Lower Bounds on Fast Searching
نویسندگان
چکیده
Given a graph, suppose that intruders hide on vertices or along edges of the graph. The fast searching problem is to find the minimum number of searchers required to capture all intruders satisfying the constraint that every edge is traversed exactly once and searchers are not allowed to jump. In this paper, we prove lower bounds on the fast search number. We present a linear time algorithm to compute the fast search number of Halin graphs and their extensions. We present a quadratic time algorithm to compute the fast search number of cubic graphs.
منابع مشابه
New Distance Lower Bounds for Efficient Proximity Searching in Metric Spaces
The prune rules derived from the triangle inequality has long been the most prevalent technique to avoid distance computations when fast nearest neighbor (NN) searching is sought in a general metric spaces. In this paper we introduce a group of new lower bounds to estimate the unknown distances in a metric space. The new bounds are proven to be tighter than the triangular inequality induced low...
متن کاملCapacity Bounds and High-SNR Capacity of the Additive Exponential Noise Channel With Additive Exponential Interference
Communication in the presence of a priori known interference at the encoder has gained great interest because of its many practical applications. In this paper, additive exponential noise channel with additive exponential interference (AENC-AEI) known non-causally at the transmitter is introduced as a new variant of such communication scenarios. First, it is shown that the additive Gaussian ch...
متن کاملOn Searching Sorted Lists: A Near-Optimal Lower Bound
We obtain improved lower bounds for a class of static and dynamic data structure problems that includes several problems of searching sorted lists as special cases. These lower bounds nearly match the upper bounds given by recent striking improvements in searching algorithms given by Fredman andWillard's fusion trees [9] and Andersson's search data structure [5]. Thus they show sharp limitation...
متن کاملFrom Time to Space: Fast Algorithms That Yield Small and Fast Data Structures
In many cases, the relation between encoding space and execution time translates into combinatorial lower bounds on the computational complexity of algorithms in the comparison or external memory models. We describe a few cases which illustrate this relation in a distinct direction, where fast algorithms inspire compressed encodings or data structures. In particular, we describe the relation be...
متن کامل